Incentives in Core-Selecting Auctions
نویسنده
چکیده
Incentives in Core-Selecting Auctions Paul Milgrom October 18, 2006 A “core-selecting auction mechanism” is a direct mechanism for a multi-item allocation problem that selects a core allocation with respect to the bidders’ reported values and the auctioneer’s exogenously given preferences. For every profile of others’ reports, a bidder has a best reply that is a truncation report. For every “bidder optimal” core imputation, there exists a profile of truncation reports that is a full-information Nash equilibrium for every core-selecting auction with those payoffs. Among core-selecting auctions, the incentives to deviate from truthful reporting are minimal at every preference profile if and only if the auction always selects a bidder optimal allocation with respect to the reported preferences. Finally, a core-selecting auction that selects a minimum revenue core allocation is a bidder optimal auction and make the seller’s revenue a non-decreasing function of the bids, which eliminates distortions that can otherwise occur in the process of bidder application and qualification. All these results have analogues in two-sided matching theory.
منابع مشابه
Optimal Incentives in Core-Selecting Auctions
Optimal Incentives in Core-Selecting Auctions Robert Day, School of Business, University of Connecticut Paul Milgrom, Dept of Economics, Stanford University August 25, 2010 Auctions that select core allocations with respect to reported values generate competitive levels of sales revenues at equilibrium and limit bidder incentives to use shills. Among core-selecting auctions, the ones that selec...
متن کاملCore-selecting package auctions
Auctions that select core allocations with respect to reported values generate competitive levels of sales revenues at equilibrium and limit bidder incentives to use shills. Among core-selecting auctions, the ones that minimize seller revenues also maximize incentives for truthful reporting, produce the Vickrey outcome when that lies in the core and, in contrast to the Vickrey auction, and crea...
متن کاملThe Vickrey-Target Strategy and the Core in Ascending Combinatorial Auctions
This paper considers a general class of combinatorial auctions with ascending prices, which includes the Vickrey-Clarke-Groves mechanism and core-selecting auctions. We analyze incentives in ascending combinatorial auctions under complete and perfect information. We show that in every ascending auction, the “Vickrey-target strategy” constitutes a subgame perfect equilibrium with a restricted st...
متن کاملCore-Selecting Payment Rules for Combinatorial Auctions with Uncertain Availability of Goods
In some auction domains, there is uncertainty regarding the final availability of the goods being auctioned off. For example, a government may auction off spectrum from its public safety network, but it may need this spectrum back in times of emergency. In such a domain, standard combinatorial auctions perform poorly because they lead to violations of individual rationality (IR), even in expect...
متن کاملCore-pricing in large multi-object auctions: a market design for selling TV-ads
We introduce an auction design and computational methods to determine core payments for large markets with many objects such as the market for TV ads. Bidder optimal, core-selecting auctions have been introduced in spectrum auctions worldwide as a means to set incentives for truthful bidding, but at the same time avoid the problems of the Vickrey-Clarke-Groves mechanism. Many real-world markets...
متن کامل